Interval State Estimation for Attack Detection Base on PQ decomposition
نویسندگان
چکیده
منابع مشابه
An Effective Attack-Resilient Kalman Filter-Based Approach for Dynamic State Estimation of Synchronous Machine
Kalman filtering has been widely considered for dynamic state estimation in smart grids. Despite its unique merits, the Kalman Filter (KF)-based dynamic state estimation can be undesirably influenced by cyber adversarial attacks that can potentially be launched against the communication links in the Cyber-Physical System (CPS). To enhance the security of KF-based state estimation, in this paper...
متن کاملAttack Resilient State Estimation for Vehicular Systems
DISCLAIMER The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of the U.S. Department of Transportation's University Transportation Centers Program, in the interest of information exchange. The U.S. Government assumes no liability for the contents...
متن کاملState estimation and detection of changes in time interval models
This paper presents an estimation approach for Time Event Graphs such as P-Time Event Graphs and Time Stream Event Graphs. It is assumed that the nominal behavior is known and that transitions are partitioned as observable and unobservable transitions. The technique is applied to the detection of changes which are (possibly small) finite variations of dynamic models compared to this nominal beh...
متن کاملInterval State Estimation for Uncertain Nonlinear Systems
The objective of this work is to develop some design methods of interval observers for a class of nonlinear continuous-time systems. It is assumed that the estimated system can be represented as a superposition of the nominal subsystem (belonged to the class of uniformly observable systems) and a Lipschitz nonlinear perturbation vanishing at the origin. Then it is shown there exists an interval...
متن کاملDecomposition attack on SASASASAS
We demonstrate the first attacks on the SPN ciphers with 6, 7, 8, and 9 secret layers. In particular, we show a decomposition attack on the SASASASAS scheme when the S-box size m and the block length n satisfy the condition m ≤ n (for example, 8-bit S-box and 128-bit block).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2019
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2019.01.046